منابع مشابه
The Kadison-Singer Conjecture
We are given a large integer N , and a fixed basis {ei : 1 ≤ i ≤ N} for the space H = C . We are also given an N -by-N matrix H that has all its diagonal entries zero, and has norm one. If σ ⊆ {1, 2, . . . , N}, let Pσ be the projection onto the space Hσ := ∨{ei : i ∈ σ}. Call such a projection basic, and the range of a basic projection a basic subspace. For each constant 0 < γ < 1, we want to ...
متن کاملNouvelles écritures de théâtre - Le texte est tout le problème
The term “new writings” refers globally to new forms of story telling. In the same way that the invention of cinema disrupted the writing of literature in both its themes and aesthetics, so the arrival of new technologies (cd-rom and the Internet) is bound to influence books and films by its own unique narrative modes. At the height of the breaches induced by reciprocal influences, where does t...
متن کاملThe Other Kadison–singer Problem
Let H be `2 (over C) and let B(H) denote the C*-algebra of all bounded operators on H. Fix an orthonormal basis (en) for H. The atomic masa corresponding to this basis is `∞; equivalently, the algebra of all operators that are diagonalized by the basis (en). The projections in `∞ are exactly the projections onto subspaces spanned by a subset of {en}. That is, P(`∞) ∼= P(N) (here P(A) denotes th...
متن کاملKadison-Singer algebras: hyperfinite case.
A new class of operator algebras, Kadison-Singer algebras (KS-algebras), is introduced. These highly noncommutative, non-self-adjoint algebras generalize triangular matrix algebras. They are determined by certain minimally generating lattices of projections in the von Neumann algebras corresponding to the commutant of the diagonals of the KS-algebras. A new invariant for the lattices is introdu...
متن کاملUne contrainte globale pour le problème de l'isomorphisme de graphes
The graph isomorphism problem consists in deciding if two given graphs have an identical structure. This problem can be modeled as a constraint satisfaction problem in a very straightforward way, so that one can use constraint programming to solve it. However, constraint programming is a generic tool that may be less efficient than dedicated algorithms which can take advantage of the global sem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales mathématiques Blaise Pascal
سال: 2015
ISSN: 1259-1734,2118-7436
DOI: 10.5802/ambp.350